Termination w.r.t. Q of the following Term Rewriting System could not be shown:
Q restricted rewrite system:
The TRS R consists of the following rules:
a(lambda(x), y) → lambda(a(x, 1))
a(lambda(x), y) → lambda(a(x, a(y, t)))
a(a(x, y), z) → a(x, a(y, z))
lambda(x) → x
a(x, y) → x
a(x, y) → y
Q is empty.
↳ QTRS
Q restricted rewrite system:
The TRS R consists of the following rules:
a(lambda(x), y) → lambda(a(x, 1))
a(lambda(x), y) → lambda(a(x, a(y, t)))
a(a(x, y), z) → a(x, a(y, z))
lambda(x) → x
a(x, y) → x
a(x, y) → y
Q is empty.